Polar codes are capacity achieving error correcting codes that can be decodedthrough the successive-cancellation algorithm. To improve its error-correctionperformance, a list-based version called successive-cancellation list (SCL) hasbeen proposed in the past, that however substantially increases the number oftime-steps in the decoding process. The simplified SCL (SSCL) decodingalgorithm exploits constituent codes within the polar code structure to greatlyreduce the required number of time-steps without introducing anyerror-correction performance loss. In this paper, we propose a faster decodingapproach to decode one of these constituent codes, the Rate-1 node. We use thisRate-1 node decoder to develop Fast-SSCL. We demonstrate that only alist-size-bound number of bits needs to be estimated in Rate-1 nodes andFast-SSCL exactly matches the error-correction performance of SCL and SSCL.This technique can potentially greatly reduce the total number of time-stepsneeded for polar codes decoding: analysis on a set of case studies show thatFast-SSCL has a number of time-steps requirement that is up to 66.6% lower thanSSCL and 88.1% lower than SCL.
展开▼
